On the isomorphism problem for a family of cubic metacirculant graphs
نویسنده
چکیده
In this paper an isomorphism testing algorithm for graphs in the family of all cubic metacirculant graphs with non-empty first symbol So is given. The time complexity of this algorithm is also evaluated.
منابع مشابه
On the distance eigenvalues of Cayley graphs
In this paper, we determine the distance matrix and its characteristic polynomial of a Cayley graph over a group G in terms of irreducible representations of G. We give exact formulas for n-prisms, hexagonal torus network and cubic Cayley graphs over abelian groups. We construct an innite family of distance integral Cayley graphs. Also we prove that a nite abelian group G admits a connected...
متن کاملOn Hamilton cycles in cubic (m, n)-metacirculant graphs, II
continue to investigate the problem of the existence of a Hamilton connected cubic (m,n)-metacirculant graphs. We show that a connected cubic (m,n)-metacirculant graph G = MC(m, n, a, So, ,.., has Hamilton cycle if either a 2 == 1 (mod n) or in the case of an odd number f.L one of the numbers (a 1) or a + a 2 _ ... ajJ.-2 + ajJ.-l) relatively to n. As a corollary of results we obtain that every...
متن کاملOn Hamilton cycles in cubic (m, n)-metacirculant graphs
Connected cubic (m,n)-metacircu1ant graphs, other than the Petersen , have been to be hamiltonian for m m divisible by 4 and m = 2. In this paper we two sufficient conditions tor connected cubic-metac1rcu1ant with m even, than 2 and not divisible by 4 to be hamiltonian. As corQ1laries, we show that every connected cubic-metacircu1ant other than the Petersen ,has a Hamilton if anyone of the cond...
متن کاملUncountable families of vertex-transitive graphs of finite degree
Recently the following question was relayed [1] to the second author: What is the cardinality of the set of vertex transitive graphs of finite degree? Our aim in this short note is to show that there are 20 such graphs. Our proof is constructive and is based on ideas of B. Neumann [3]. In order to construct a large such set it is natural to turn to Cayley graphs of finitely generated groups (se...
متن کاملThe robust vertex centdian location problem with interval vertex weights on general graphs
In this paper, the robust vertex centdian location problem with uncertain vertex weights on general graphs is studied. The used criterion to solve the problem is the min-max regret criterion. This problem is investigated with objective function contains $lambda$ and a polynomial time algorithm for the problem is presented. It is shown that the vertex centdian problem on general graphs i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 151 شماره
صفحات -
تاریخ انتشار 1996